Coronas for properly combable spaces
نویسندگان
چکیده
This paper is a systematic approach to the construction of coronas (i. e. Higson dominated boundaries at infinity) of combable spaces. We introduce three additional properties for combings: properness, coherence and expandingness. Properness is the condition under which our construction of the corona works. Under the assumption of coherence and expandingness, attaching our corona to a Rips complex construction yields a contractible σ-compact space in which the corona sits as a Z-set. This results in bijectivity of transgression maps, injectivity of the coarse assembly map and surjectivity of the coarse co-assembly map. For groups we get an estimate on the cohomological dimension of the corona in terms of the asymptotic dimension. Furthermore, if the group admits a finite model for its classifying space BG, then our constructions yield a Z-structure for the group.
منابع مشابه
The Conjugacy and Isomorphism Problems for Combable Groups
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
متن کاملQuasi-isometries and Amalgamations of Tame Combable Groups
We study the property of tame combability for groups. We show that quasi-isometries preserve this property. We prove that an amalgamation, A ∗C B, where C is finitely generated, is tame combable iff both A and B are. An analogous result is obtained for HNN extensions. And we show that all one-relator groups are tame combable.
متن کاملGeometry & Topology Monographs Hairdressing in Groups: a Survey of Combings and Formal Languages
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This article surveys results for combable groups, in particular in the case where the combing is a formal language.
متن کاملHairdressing in groups: a survey of combings and formal languages
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This article surveys results for combable groups, in particular in the case where the combing is a formal language. AMS Classi cation 20F10, 20-04, 68Q40; 03D40
متن کاملq-Variation and Commutators for Fourier Multipliers
If Tμ is a Fourier multiplier such that μ is any (possibly unbounded) symbol with uniformly bounded q-variation on dyadic coronas, we prove that the commutator [T, Tμ] = TTμ−TμT is bounded on the Besov space B p (R ), if T is any bounded linear operator on a couple of Besov spaces Bj ,rj p (R) (j = 0, 1, and 0 < σ1 < σ < σ0).
متن کامل